Interference management messaging involving termination of a request for reduction in interference

ABSTRACT

A set of nodes may communicate in a manner that is asynchronous with respect to the communication between other sets of nodes. To facilitate reservations of resources by different nodes, a node may transmit a message that requests neighboring nodes to limit their interfering transmissions on a given resource and then transmit another message to inform the neighboring nodes that the node is no longer using the resource. To address problems that may be caused by concurrent asynchronous transmissions by different nodes, a messaging scheme may be used to enable a first node to acquire control information transmitted by asynchronous neighboring nodes while the first node was transmitting, and was thereby unable to receive control messages.

CLAIM OF PRIORITY UNDER 35 U.S.C. §120

The present Application for Patent is a Divisional of patent applicationSer. No. 12/062,375 entitled “INTERFERENCE MANAGEMENT MESSAGINGINVOLVING TERMINATION OF A REQUEST FOR REDUCTION IN INTERFERENCE” filedApr. 3, 2008, pending, and assigned to the assignee hereof and herebyexpressly incorporated by reference herein.

CROSS-REFERENCE TO RELATED APPLICATION

This application is related to concurrently filed and commonly ownedU.S. Patent Application entitled “REQUESTED TRANSMISSION OF INTERFERENCEMANAGEMENT MESSAGES,” and assigned Attorney Docket No. 061896U2, thedisclosure of which is hereby incorporated by reference herein.

BACKGROUND

1. Field

This application relates generally to wireless communication and morespecifically, but not exclusively, to messaging for managinginterference.

Introduction

Deployment of a wireless communication system typically involvesimplementing some form of interference mitigation scheme. In somewireless communication systems, interference may be caused byneighboring wireless nodes. As an example, in a cellular system,wireless transmissions of a cell phone or a base station of a first cellmay interfere with communication between a cell phone and a base stationof a neighboring cell. Similarly, in a Wi-Fi network, wirelesstransmissions of an access terminal or an access point of a firstservice set may interfere with communication between an access terminaland a base station of a neighboring service set.

U. S. Patent Application Publication No. 2007/0105574, the disclosure ofwhich is hereby incorporated by reference, describes a system wherefair-sharing of a wireless channel may be facilitated by jointscheduling of a transmission by transmitting and receiving nodes throughthe use of a resource utilization message. Here, a transmitting node mayrequest a set of resources based on knowledge of resource availabilityin its neighborhood and a receiving node may grant the request based onknowledge of resource availability in its neighborhood. For example, thetransmitting node may determine channel availability by listening toreceiving nodes in its vicinity and the receiving node may determinepotential interference by listening to transmitting nodes in itsvicinity.

In the event the receiving node is subjected to interference fromneighboring transmitting nodes, the receiving node may transmit aresource utilization message in an attempt to cause the neighboringtransmitting nodes to limit their interfering transmissions. Accordingto related aspects, a resource utilization message may be weighted toindicate not only that a receiving node is disadvantaged (e.g., due tothe interference it sees while receiving) and desires a collisionavoidance mode of transmission, but also the degree to which thereceiving node is disadvantaged.

A transmitting node that receives a resource utilization message mayutilize the fact that it has received a resource utilization message, aswell as the weight thereof, to determine an appropriate response. Forexample, the transmitting node may elect to abstain from transmitting,may reduce its transmit power during one or more designated timeslots,may ignore the resource utilization message, or may respond in someother manner. The advertisement of the resource utilization messages andassociated weights may thus provide a collision avoidance scheme that isfair to all nodes in the system.

SUMMARY

A summary of sample aspects of the disclosure follows. It should beunderstood that any reference to the term aspects herein may refer toone or more aspects of the disclosure.

The disclosure relates in some aspects to asynchronous communication.For example, one set of nodes (e.g., a transmitting node and a receivingnode that are associated to communicate with one another) maycommunicate in a manner that is asynchronous with respect to thecommunication between other sets of nodes. Here, the timing and durationof a transmission for a given set of nodes may be defined independentlyof the timing and duration of a transmission for a different set ofnodes.

The disclosure relates in some aspects to messaging that facilitatesreservation of a resource by different nodes. For example, a node maytransmit a message that requests neighboring nodes to limit theirinterfering transmissions on a given resource (e.g., a carrier) for anunspecified amount of time. When the node has finished using theresource, the node may transmit another message to inform theneighboring nodes that the node is no longer reserving the resource.

The disclosure relates in some aspects to messaging that addressesproblems that may be caused by concurrent asynchronous transmissions bydifferent nodes. For example, a messaging scheme may be employed toenable a first node to acquire control information that asynchronousneighboring nodes transmitted while the first node was transmitting.Here, after completing a data transmission, the first node may transmita message that comprises a request to the neighboring nodes to sendcontrol messages. In some aspects such a message may comprise a poll ofall receiving nodes that have an outstanding (e.g., non-expired)resource utilization message, whereby these receiving nodes arerequested to retransmit their resource utilization messages. Aftersending its message, the first node may monitor for responsive messagesfor a defined period of time. In addition, the neighboring nodes may beconfigured to transmit any control messages they wish to send within thedefined period of time. In this way, the first node may acquire anyinformation that it did not receive from the neighboring nodes when itwas transmitting data. Moreover, this may be achieved even though thecommunications of the nodes sending the information are asynchronous tothe communications of the first node.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other sample aspects of the disclosure will be described inthe detailed description and the appended claims that follow, and in theaccompanying drawings, wherein:

FIG. 1 is a simplified block diagram of several sample aspects of awireless communication system;

FIG. 2 is a flow diagram illustrating several sample aspects of aresource management messaging scheme;

FIG. 3 is a flow diagram illustrating several sample aspects of aresource management messaging scheme;

FIG. 4 is a simplified block diagram of several sample components ofcommunication nodes;

FIG. 5 is a flowchart of several sample aspects of operations that maybe performed by a receiving node;

FIG. 6 is a flowchart of several sample aspects of operations that maybe performed by a transmitting node;

FIG. 7 is a flowchart of several sample aspects of operations that maybe performed by a transmitting node;

FIG. 8 is a flowchart of several sample aspects of operations that maybe performed in conjunction with switching between an asynchronous modeand a synchronous mode;

FIG. 9 is a simplified block diagram of several sample aspects ofcommunication components; and

FIGS. 10 and 11 are simplified block diagrams of several sample aspectsof apparatuses configured to provide interference management messagingas taught herein.

In accordance with common practice the various features illustrated inthe drawings may not be drawn to scale. Accordingly, the dimensions ofthe various features may be arbitrarily expanded or reduced for clarity.In addition, some of the drawings may be simplified for clarity. Thus,the drawings may not depict all of the components of a given apparatus(e.g., device) or method. Finally, like reference numerals may be usedto denote like features throughout the specification and figures.

DETAILED DESCRIPTION

Various aspects of the disclosure are described below. It should beapparent that the teachings herein may be embodied in a wide variety offorms and that any specific structure, function, or both being disclosedherein is merely representative. Based on the teachings herein oneskilled in the art should appreciate that an aspect disclosed herein maybe implemented independently of any other aspects and that two or moreof these aspects may be combined in various ways. For example, anapparatus may be implemented or a method may be practiced using anynumber of the aspects set forth herein. In addition, such an apparatusmay be implemented or such a method may be practiced using otherstructure, functionality, or structure and functionality in addition toor other than one or more of the aspects set forth herein. Furthermore,an aspect may comprise at least one element of a claim. As an example ofthe above, in some aspects a method of wireless communication comprisestransmitting a first interference management message (e.g., a resourceutilization message) that comprises a request for reduction ininterference and transmitting a second interference management message(e.g., a resource release message) that indicates that the request forreduction in interference is terminated. In addition, in some aspectsthe request for reduction in interference may expire after a definedperiod of time.

For illustration purposes, the discussion that follows may describevarious nodes, components, and operations of a wireless system where anaccess point communicates with one or more access terminals. It shouldbe appreciated that the teachings herein also may be applicable to othertypes of nodes, devices, and communication systems.

FIG. 1 illustrates several sample aspects of a wireless communicationsystem 100. The system 100 includes several wireless nodes, generallydesignated as wireless nodes 102 and 104. A given wireless node mayreceive and/or transmit one or more traffic flows (e.g., data flows).For example, each wireless node may comprise at least one antenna andassociated receiver and transmitter components. In the discussion thatfollows the term receiving node may be used to refer to a wireless nodethat is receiving and the term transmitting node may be used to refer toa wireless node that is transmitting. Such a reference does not implythat the wireless node is incapable of performing both transmit andreceive operations.

A wireless node may be implemented in various ways. For example, in someimplementations a wireless node may comprise an access terminal, a relaypoint, or an access point. Referring to FIG. 1, the wireless nodes 102may comprise access points or relay points and the wireless nodes 104may comprise access terminals. In some implementations the wirelessnodes 102 facilitate communication between the wireless nodes of anetwork (e.g., a Wi-Fi network, a cellular network, a WiMAX network, orsome other type of network). For example, when an access terminal (e.g.,an access terminal 104A) is within a coverage area of an access point(e.g., an access point 102A) or a relay point, the access terminal 104Amay thereby communicate with another device of the system 100 or someother network that is coupled to communicate with the system 100. Here,one or more of the wireless nodes (e.g., wireless nodes 102A and 102C)may comprise a wired access point that provides connectivity to anothernetwork or networks (e.g., a wide area network 108 such as theInternet).

When a wireless node is within communication range of another wirelessnode, the nodes may associate with one another to establish acommunication session. Moreover, different sets of nodes may associatewith one another in a given neighborhood. For example, one set of nodes(e.g., associated with an access point 102B in FIG. 1) may form onecommunication sector while another set of nodes (e.g., associated withthe access point 102C) may form a neighboring sector. Consequently, oneor more traffic flows may be established in the first sector from atransmitting node (e.g., node 102B) to an associated receiving node(e.g., node 104B). In addition, one or more traffic flows may beestablished in the second sector from a transmitting node (e.g., node102C) to an associated receiving node (e.g., node 104C).

In some cases, wireless nodes in the system 100 may transmit at the sametime such that transmission by one wireless node may interfere withreception at another wireless node (e.g., a non-associated node ofanother communication sector). For example, a wireless node 104B of onesector may be receiving from its associated wireless node 102B (asrepresented by a wireless communication symbol 106A) at the same timethat a wireless node 102C of another sector is transmitting to itswireless node 104C (as represented by a symbol 106B). Depending on thedistance between the wireless nodes 104B and 102C and the transmissionpower of the wireless node 102C, transmissions from the wireless node102C (as represented by a dashed symbol 106C) may interfere withreception at the wireless node 104B. In a similar manner, transmissionsfrom the wireless node 104B may interfere with reception at the wirelessnode 102C depending on the transmission power of the wireless node 104B.

To mitigate interference such as this, the nodes of a wirelesscommunication system may employ a resource management messaging scheme.For example, a receiving node that wishes to reduce interference duringreceive operations may transmit a resource utilization message (“RUM”)to indicate that this receiving node is requesting priority access to agiven resource (e.g., because reception at the node is disadvantaged insome way). A neighboring wireless node that receives the RUM (e.g., apotential interferer) may elect to limit its future transmissions insome way to avoid interfering with reception at the RUM-sending node(i.e., the receiving node that sent the RUM). Here, a decision by areceiving node to transmit a RUM may be based, at least in part, onquality of service associated with data received at that receiving node.For example, a receiving node may transmit a RUM in the event thecurrent level of quality of service for one or more of its links orflows falls below a desired quality of service level. Conversely, thereceiving node may not transmit a RUM if the quality of service isacceptable.

In some aspects, different sets of nodes in the system 100 maycommunicate in an asynchronous manner with respect to other sets ofnodes. For example, each set of associated nodes (e.g., a set includingnodes 102B and 104B) may independently select when and for how long oneof the nodes in the set will transmit data to the other node in the set.In such a case, these nodes may not be able to effectively controlinterference caused by a neighboring asynchronous node since these nodesmay not know when the neighboring node will transmit its controlmessages (e.g., interference management messages such as RUMs). Thediscussion that follows describes various techniques that may beemployed to reduce interference between nodes and that may be employedin an attempt to ensure that a transmitting node is able to obtaincontrol messages that were transmitted by a neighboring node when thetransmitting node was transmitting.

In some aspects, the nodes may communicate through the use of frequencydivision multiplexed control and data channels. For example, controlmessages (e.g., RUMs) may be transmitted on a control channel on onefrequency band and data may be being transmitted over a data channel onanother frequency band. In this way, potential interference betweentransmitted control messages and data may be mitigated even when thesemessage are transmitted concurrently.

Sample resource management-related operations of a system such as thesystem 100 will now be discussed in more detail in conjunction with theflow diagrams of FIGS. 2 and 3. For convenience, the operationsrepresented by FIGS. 2 and 3 (or any other operations discussed ortaught herein) may be described as being performed by specificcomponents (e.g., components of a system 400 as depicted in FIG. 4). Itshould be appreciated, however, that these operations may be performedby other types of components and may be performed using a differentnumber of components. It also should be appreciated that one or more ofthe operations described herein may not be employed in a givenimplementation.

FIG. 2 illustrates, in a simplified manner, information flow betweenseveral neighboring nodes A, B, C, and D in a communication system.Here, nodes A and B are associated with one another and nodes C and Dare associated with one another. In the illustrated example, nodes A andB exchange control messages to enable node A to send data to node B.Similarly, nodes C and D exchange control messages to enable node C tosend data to node D. Thus, nodes A and C may comprise transmitting nodesand nodes B and D may comprise receiving nodes in the discussion thatfollows.

In some aspects, the communication between nodes A and B may beasynchronous to the communication between nodes C and D. To manageinterference that may occur when these nodes are accessing the sameresource (e.g., channel), the receiving nodes may transmit controlmessages (e.g., broadcast a RUM) to neighboring transmitting nodes in anattempt to clear interference from the resource. In addition, thereceiving nodes may transmit other control messages (e.g., broadcast aresource release message) to let the neighboring nodes know when theresource is no longer being used. In other words, the resource releasemessage announces the end of a transmission that was protected by a RUM.

Reference will initially be made to the messages generated by nodes Aand B. As long as it is not blocked by an active RUM from a receivingnode (e.g., as discussed in more detail below), node A transmits (e.g.,unicasts) a request message REQ-A to node B to initiate a datatransmission session with node B. In some aspects, this request messagemay include an indication regarding the amount of data to be sent tonode B (e.g., the size of the outstanding buffer).

In response to this request, node B may transmit a RUM (designated inFIG. 2 as a receive RUM, “RxRUM”) if it is experiencing interferenceduring its receive operations. In some aspects, the RxRUM-B may comprisea request from node B to its neighboring nodes to reduce interference ona resource (e.g., a resource designated by the RxRUM). An RxRUM may bedefined such that it expires after a given period of time (e.g., atime-to-live time period).

Nodes that wish to schedule upcoming transmissions are configured tomonitor for such RxRUMs from neighboring nodes. As represented by thearrowed lines associated with the RxRUM-B, nodes A and C receiveRxRUM-B. In the event a transmitting node (e.g., node A and/or node C)receives RxRUMs from more than one receiving node, the transmitting nodemay resolve contention between these RxRUMs (e.g., based on prioritiesassociated with the RxRUMs as discussed below). In the example of FIG.2, its is assumed no other receiving nodes have sent an RxRUM having ahigher priority than RxRUM-B. Consequently, node A may transmit (e.g.,broadcast) a RUM (designated as a transmit RUM, “TxRUM,” in FIG. 2) toinform neighboring nodes that its receiving node (node B) has won thecurrent contention. As represented by the arrowed line associated withTxRUM-A, nodes B and D receive TxRUM-A, but node C does not.Nevertheless, since node C received RxRUM-B, node C may determine thatRxRUM-B has the highest priority and may therefore elect to limit itstransmissions on the designated resource as long as RxRUM-B is active.

Upon receipt of TxRUM-A, node B may transmit (e.g., unicast) a grantmessage to node A, informing node A that node B has scheduled thetransmission. In some aspects, this grant message may specifytransmission parameters such as bandwidth, transmission rate,transmission power, communication coding, number of channels, and so on,to be used during the transmission. Here, node B may select theseparameters based on the current condition of the resource (e.g.,interference measured by node B).

Upon receipt of this grant message (e.g., GRANT-B), node A commencesdata transmission to node B. In FIG. 2, the corresponding transmissionopportunity (“TXOP”) is represented by the shaded area delineated by theTx-A designations.

Once node A completes its transmission (e.g., at the end of node A'sTXOP), node B may transmit a resource release message (“RRM”) to informneighboring transmitting nodes that node A is no longer transmitting onthe resource. Thus, in some aspects, the RRM-B may serve to indicatethat RxRUM-B's request for reduction in interference is now terminated.For convenience of illustration, the location of the arrowed line forRRM-B is not shown as coinciding with the end of the TXOP for node A inFIG. 2. It should be appreciated, however, that node B may transmitRRM-B immediately after this TXOP ends.

As mentioned above, a transmitting node may not receive any controlmessages sent by neighboring nodes when that node is transmitting.Consequently, a status update (“STU”) period is defined after the TXOPto enable the node to acquire information it may have missed whentransmitting. If the transmitting node has more data to send, before itattempts to transmit again, the node is configured to receive during thestatus update period to acquire control messages (e.g., RUMs) sent byother nodes.

Conversely, if a transmitting node does not have any more data to send,the node may simply switch to a receiving mode. Thus, the node mayimmediately listen for a request from an associated transmitting nodeand transmit RUMs over the control channel, if applicable.

In the example of FIG. 2, upon learning that the resource is nowavailable as indicated by RRM-B, node C transmits a message (“REQ-C”)requesting authorization to transmit to node D. If node D isexperiencing undue interference, node D may then send a receive RUM(“RxRUM-D”), whereupon node C may send a transmit RUM (“TxRUM-C”) asshown in FIG. 2. Node B may then send a grant (“GRANT-D”) authorizingnode C to transmit data to node B. Alternatively, in the event node D isnot experiencing undue interference, node D may simply grant the requestwhereby the RxRUM, TxRUM, and RRM are not used.

The corresponding TXOP for node C′s transmission is represented by theshaded area delineated by the Tx-C designations. Once node C completesits transmission, node D may transmit a resource release message(“RRM-D”) and node C may monitor the resource during its status updateperiod (“STU-C”).

FIG. 3 illustrates an example where nodes A and C transmit concurrentlyon the same resource. As described above in conjunction with FIG. 2,nodes A and B transmit control messages to establish a transmissionopportunity (designated TXOP A in FIG. 3) on a designated resource.

In this example, however, node C determines that it may transmit on thedesignated resource concurrently with node A. For example, as will bedescribed in more detail below, node C may determine that it will notunduly interfere with reception at node B based on information proved byRxRUM-B. Here, node C may define one or more of its transmissionparameters (e.g., transmission rate, transmission power, coding, and soon) to reduce the impact its transmissions may have on reception at nodeB.

In a similar manner as described above in conjunction with FIG. 2, nodesC and D may transmit control messages REQ-C, RxRUM-D, TxRUM-C, andGRANT-D to establish a transmission opportunity (designated TXOP C) onthe designated resource. The grant from node D may take into account(e.g., when defining transmission parameters) any interference that nodeA is causing at node D. In this case, node A will not “hear” RxRUM-Dbecause node A is transmitting when node D transmits RxRUM-D. RxRUM-Dmay still be useful, however, to contend against other nodes for theresource.

FIG. 3 illustrates how a request RUM (“ReqRUM”) control message andseveral defined time periods may be used to enable a node that has beentransmitting (and, hence, not receiving control messages) to acquireinformation from neighboring nodes. As mentioned above, the statusupdate period relates to a designated period of time after completion ofa TXOP during which a transmitting node will abstain from transmitting.Specifically, a transmitting node that wishes to continue transmittingwill monitor for control messages (e.g., RxRUMs) from neighboring nodesduring this time period to determine whether it should limit itstransmission to avoid interfering with reception at the neighboringnodes.

Update periods (designated “Tu” in FIG. 3) also may be defined withineach TXOP to enable a receiving node to periodically transmit controlmessages. For example, at regular intervals based on Tu, a transmittingnode (e.g., node A) will stop transmitting for a defined period of time(e.g., the gap between adjacent Tu time periods in FIG. 3).Concurrently, the receiving node (e.g., node B) associated with thattransmitting node may switch to a transmit mode during the definedperiod of time. For example, a receiving node may transmit an RxRUMduring this time period if the receiving node received a ReqRUM duringthe preceding Tu period. In this way, a receiving node may be configuredto transmit an RxRUM within a defined period of time (e.g., based on Tu)after receiving a ReqRUM.

Referring again to the message flow of FIG. 3, once node A completes itstransmission for its TXOP A, node A will transmit a ReqRUM if it hasmore data to send. In some cases, node A's transmission of ReqRUM-A willcommence the running of the status update period STU-A. For convenienceof illustration, however, the location of the arrowed line for ReqRUM-Ais not shown as coinciding with the beginning of STU-A in FIG. 3.

Since node D is receiving data from node C at this time, node D mayreceive ReqRUM-A. Node D may not immediately respond to the ReqRUM,however, because this may cause node D to miss a transmission from nodeC. Instead, node D waits to transmit its RxRUM-D during the definedtransmit mode time period following the current update period (i.e.,following the second Tu period in TXOP C). Note that node D did nottransmit an RxRUM-D during the previous transmit mode time period sincenode D did not receive a ReqRUM during the preceding update period(i.e., the first Tu period in TXOP C).

By defining the status update period STU-A based on the length of Tu,node A may be assured of receiving RxRUM-D during STU-A. For example,STU may be defined as the Tu time period plus the transmit mode timeperiod plus a time margin.

In the example of FIG. 3, node A elects to limit its transmission basedon the information provided by RxRUM-D. For example, the priority ofRxRUM-B may now be lower due to better quality of service at node B.Later, after receiving RRM-D indicating that node C is no longertransmitting on the resource, node A may send a request to node B torestart its transmit operations.

In the above scenario, node C's transmission to node D may have someeffect on the interference environment at node D even though node C hasdetermined that its transmissions will not result in an unacceptablelevel of interference at node D. To address this situation, nodes A andB may change and/or confirm their current transmission parameters (e.g.,the rate assignment) following every update period interval Tu (e.g.,during the transmit mode time period during which RxRUM may berebroadcast). This may be accomplished, for example, by the receivingnode transmitting updated grant messages.

In some aspects, a TXOP may be defined as the longest continuous time anode may transmit on a resource before pausing to see if any other nodeswant to use the resource. TXOP may thus provide a lower bound on theminimum latency that may be supported by the system. TXOP also mayprovide an upper bound on maximum one-directional time sharing. Forexample, a node may transmit for a fraction of time up to1−Tu/(Tu+TXOP). The remaining time may then be utilized to receivetraffic in the other direction. In some aspects, time sharing on theresources may be controlled. For example, variable time sharing may beprovided on different parts of a network by using different TXOP valueson different resources (e.g., links) and/or for different nodes.

TXOP also may define the longest time that a transmitting node may needto wait before its request is heard by its intended receiving node(e.g., that may be busy transmitting). In such a case, the requestingnode may keep sending requests until it succeeds in establishing atransmission.

When a receiving node transmits an RxRUM in an attempt to restrict anongoing transmission by a non-associated transmitting node, thereceiving node may only need to wait for up to a TXOP time before theRxRUM is heard by the non-associated transmitting node. For example, thetransmitting node associated with the receiving node may receive theresource release message associated with the on-going transmission andthen transmit a TxRUM. Alternatively, the transmitting node associatedwith the receiving node may send the TxRUM immediately. In this case,the receiving node may delay the grant (as discussed below) until theon-going transmission terminates.

A resource management messaging scheme as described above may facilitateeffective asynchronous communication. For example, fairness betweennodes contending for a resource may be achieved through the use ofpriorities associated with the RUMs. Such a scheme may provide efficientspectrum reuse since nodes may transmit concurrently. For example, anode may elect to ignore RUMs if it is not causing unacceptableinterference (e.g., as indicated by the carrier-to-interference ratio)at the RUM-sending nodes. In addition, such a scheme may provideeffective interference management even when the nodes have differenttransmit power (e.g., through the use of RUMs that have a longer rangethan the data transmissions).

With the above overview in mind, sample implementation details and otheraspects of the disclosure will now be described with reference to FIGS.4-8. Briefly, FIG. 4 depicts a communication system including a pair ofnodes 402 and 404. FIG. 5 describes sample operations that may beperformed by a receiving node (e.g., an access point or an accessterminal). FIGS. 6 and 7 describe sample operations that may beperformed by a transmitting node (e.g., an access point or an accessterminal). FIG. 8 describes sample operations that may be performed toswitch between asynchronous communication and synchronous communication.

Referring initially to FIG. 4, for illustration purposes the node 402describes several sample components of a receiving node and the node 404describes several sample components of a transmitting node. For example,the node 402 may represent node B of FIG. 3 in some of the discussionsthat follow and may represent node D in other discussions. Similarly,the node 404 may represent node A in some discussions and node C inother discussions. It should be appreciated that any functionallydescribed as being performed by node 402 or by node 404 may, inpractice, be incorporated into a given node (e.g., node 104B of FIG. 1)for performing transmitting node operations and receiving nodeoperations at that node. Also, in some cases a node may employ commoncomponents (e.g., a common transceiver) for providing such transmit andreceive functionality.

The nodes 402 and 404 include various components for communicating withother nodes. For example, a transceiver 406 of the node 402 includes atransmitter 408 and a receiver 410. In addition, a transceiver 412 ofthe node 404 includes a transmitter 414 and a receiver 416. The nodes402 and 404 also include respective message controllers 418 and 420 forgenerating messages to be sent to another node via a transmitter and forprocessing messages received from another node via a receiver. Othercomponents of the nodes 402 and 404 will be described in conjunctionwith the discussion of FIGS. 5-8 that follows.

As represented by block 502 of FIG. 5, at some point in time a receivingnode receives a request to transmit from an associated transmittingnode. In FIG. 3, this operation may correspond to, for example, node Csending REQ-C to node D.

As represented by block 504, the receiving node may repeatedly (e.g.,continually, periodically, etc.) monitor quality of service associatedwith data it receives from an associated transmitting node. Here, adesired level of quality of service may relate to throughput (e.g., forfull buffer traffic), latency (e.g., for voice traffic), averagespectral efficiency, minimum carrier-to-interference ratio (“C/I”), orsome other suitable metric or metrics. For example, it may be desirablefor a node to receive data associated with a given type of traffic at orabove a given throughput rate (e.g., for video traffic), within a givenlatency period (e.g., for voice traffic), or without significantinterference.

In the example of FIG. 4, the receiving node 402 includes aninterference controller 422 that may be configured to analyze datareceived by the receiver 410 to determine one or more quality ofservice-related parameters associated with the data. Accordingly, thereceiving node 402 may calculate throughput of received data, calculatelatency of received data, some other parameter, or some combination ofthese parameters. In addition, the interference controller 422 mayestimate of the amount of interference imparted on the received data. Itshould be appreciated that the interference controller 422 may takeother forms and that various techniques may be employed to monitorquality of service. For example, in some implementations a node mayemploy a sliding window scheme (e.g., a short term moving average) tomonitor the level of quality of service of its received data on arelatively continual basis.

In some aspects, a determination of whether a given level of quality ofservice is being achieved may be based on comparison of the quality ofservice information provided by the interference controller 422 withinformation representative of a desired quality of service (e.g., aquality of service threshold). For example, the interference controller422 may generate a quality of service metric that indicates (e.g.,provides an estimate of) the level of quality of service that isassociated with received data over a given time period, a given numberof packets, and so on. In addition, one or more thresholds (e.g., a RUMsending threshold) may define an expected quality of service level for agiven type of traffic or for several different types of traffic. Theinterference controller 422 may thus compare the current quality ofservice metric with a quality of service threshold to determine whetherthe desired quality of service is being met at block 504.

In the event the monitored quality of service falls below a desiredquality of service level (e.g., due to interference from anon-associated transmitting node), the receiving node may transmit a RUMin an attempt to reserve the resource on which it receives data (block506). That is, in some aspects the RUM comprises an interferencemanagement message that requests a reduction in interference on theresource to thereby improve the quality of service of the receivingnode's received data. In the example of FIG. 4, the message controller418 may cooperate with the transmitter 408 to generate and transmit theRUM (and other control messages described herein).

In conjunction with generating a RUM, the receiving node may determine aRUM priority that indicates, for example, the degree to which thereceiving node is disadvantaged. Priority information associated with aRUM may take various forms. For example, in some cases priorityinformation may take the form of a weighting factor (e.g., a weightindication that is included in the RUM). In some implementations a RUMweight may be defined as a quantized value of a ratio of the desiredquality of service (e.g., corresponding to a RUM-sending threshold) anda quality of service metric relating to the quality of service that isactually achieved. Such a weighting factor may be normalized to reduceits overhead. For example, a weight may be represented by a few bits(e.g., two or three bits). In some cases, priority may be indicated bythe ordering of RUMs (e.g., in time and/or frequency). For example, RUMsoccurring earlier in time may be associated with a higher priority.Thus, in some cases the receiving node may convey priority informationby the manner in which a RUM is transmitted.

In some aspects a RUM may be used to mitigate (e.g., clear) interferenceon one or more carriers. For example, in some cases each RUM relates toa single carrier (e.g., associated with a given frequency band). Inthese cases, the wireless node may transmit a RUM whenever the nodewishes to clear interference on that carrier. In other cases, each RUMmay relate to a set of carriers. For example, in some multi-carriersystems a wireless node may transmit a RUM whenever it wishes to clearinterference on all of the carriers. In other multi-carrier systems aRUM may be used to clear a subset of the available carriers. Forexample, when a wireless node wishes to clear interference on a subsetof the carriers, the wireless node may transmit a RUM in conjunctionwith an indication of the carrier(s) to which the RUM applies. In such acase, the carrier indication may be included in the RUM.

A carrier indication may take various forms. For example, in some casesthe carrier indication may take the form of a set of bits where each bitcorresponds to a branch of a tree, and where each branch corresponds, inturn, to a carrier. For example, one bit may correspond to a firstcarrier, another bit may correspond to a set of carriers (e.g., whichmay include one or more carriers or sets of carriers). In other cases,the carrier indication may take the form of a bit mask. For example,each bit of the mask may correspond to a unique one of the carriers.

A RUM may take various forms. For example, in some cases a RUM mayconsist of a series of tones. In some cases different tones may coverdifferent frequency bands. In some cases the RUMs from different nodesmay be ordered in some manner (e.g., in time and/or frequency).

A RUM may be transmitted in various ways. In some cases a RUM may bebroadcast. In some cases a RUM may be transmitted at a known (e.g.,constant) power level (e.g., power spectral density). In some cases aRUM may be sent over one or more frequency division multiplexed channels(e.g., frequency multiplexed with respect to one or more data channels).

As represented by blocks 508 and 510, in some cases a receiving node(e.g., the message controller 418) may elect to delay issuance of agrant based on its knowledge of current transmissions and/or theinterference environment at the receiving node. For example, when thereceiving node receives a transmit RUM from its transmitting node (e.g.,TxRUM-C) indicating that the receiving node has won contention for aresource, the interference controller 422 may determine whether thereceiving node is currently experiencing a relatively high level ofinterference as a result of ongoing transmissions by neighboring nodes.If so, at block 510 the receiving node may elect to delay granting thetransmission request until the interference subsides (e.g., but not morethan a TXOP time period). Here, since the RxRUM associated with thereceiving node does have the highest priority, there should not be anyother interfering nodes that commence transmitting during this delay.

During this delay period the transmitting node (e.g., node C) associatedwith the receiving node may continue to monitor for control message(e.g., RUMs). Thus, in the event any higher priority RUMs are receivedduring this delay period, the transmitting node may elect to defer itstransmission until each higher priority RUM expires or the resource isreleased. Alternatively, the transmitting node and its associatedreceiving node may take any intervening messages into account whenselecting transmission parameters for their TXOP.

As represented by block 512, once the receiving node determines that itwill schedule the request, the receiving node transmits a grant message(e.g., GRANT-D) and commences its receive mode for the correspondingTXOP (e.g., TXOP C). As mentioned above, a grant message may includevarious transmission parameters that are specified by the receiving nodebased on, for example, the receiving node's analysis of current channelconditions. Upon receipt of the grant message, the associatedtransmitting node may commence transmitting data to the receiving node.

As represented by block 514, the receiving node may receive a ReqRUM(e.g., ReqRUM-A) when it is receiving data from its transmitting node.As represented by block 516, the receiving node may continue to receivedata until the next designated time interval for switching to a transmitmode (e.g., as determined by a communication controller 424). Asrepresented by block 518, once this time interval is reached, thetransmit mode time period commences. During this time period thereceiving node may switch to a transmitting mode of operation. Forexample, in FIG. 4 the communication controller 424 may reconfigure thetransceiver 406 to transmit instead of receive. As mentioned above, theassociated transmitting node also ceases its transmission operationsduring this time period. Thus, in the example of FIG. 4, a communicationcontroller 426 of the node 404 may reconfigure the transceiver 412 toreceive instead of transmit.

As represented by blocks 520 and 522, in the event a ReqRUM wasreceived, the receiving node (e.g., the communication controller 424)determines whether to send a RUM in response to the ReqRUM. Here, adetermination of whether to send a RUM may involve determining whethertransmissions from the RUM-requesting node (e.g., node A) will undulyinterfere with reception at the receiving node.

For example, the transmitting node may transmit a ReqRUM at a knownpower level (e.g., a constant power spectral density). In addition, theReqRUM may be transmitted over a control channel that has a relativelylow reuse factor (e.g., 1/10 or less) so that a ReqRUM transmissiontends to experience a noise-limited channel as opposed to aninterference-limited channel. As a result, the received signal strengthof the ReqRUM may be proportional to the signal-to-noise ratio, wherebythe receiving node may determine the path loss to the RUM-requestingnode by, for example, measuring the power of the received ReqRUM (e.g.,at the receiver 410). Based on this path loss information and theknowledge about the transmit power of the transmitting node (e.g., asprovided by a transmit power indication included in the ReqRUM), thereceiving node may estimate the level of interference a transmission bythe RUM-requesting node will cause at the receiving node. If thisinterference level is relatively high (e.g., is greater than or equal toa defined threshold interference level) the receiving node may elect totransmit a RUM. Otherwise, the receiving node may elect to ignore theReqRUM.

As represented by block 524, at the end of the transmit mode timeperiod, the receiving node switches back to a receive mode of operationand continues receiving data from the transmitting node. Thus, in theexample of FIG. 4, the communication controller 424 may reconfigure thetransceiver 406 to receive instead of transmit and the communicationcontroller 426 may reconfigure the transceiver 412 to transmit insteadof receive.

As represented by block 526, the operations of blocks 514-524 may berepeated, if applicable, until the TXOP terminates. Here, TXOP may beterminated, for example, upon expiration of a defined maximum TXOP timeperiod or at some earlier time if the transmitting node has no more datato send.

As represented by block 528, the receiving node may then optionallytransmit a resource release message to inform neighboring nodes that thepreviously reserved resource is no longer being used. For example, thereceiving node may transmit a resource release message any time the TXOPis shorter than the maximum TXOP time period.

Referring now to FIG. 6, several operations that may be performed by atransmitting node will now be treated. In particular, the operations ofFIG. 6 relate to receiving one or more RUMs and, optionally, a resourcerelease message (e.g., transmitted by a receiving node as describedabove at FIG. 5).

As represented by block 602, at various points in time a transmittingnode (e.g., node C) may receive RUMs from one or more neighboringreceiving nodes. For example, the transmitting node may receive RUMsfrom one or more associated receiving nodes (e.g., node D) and/or fromone or more non-associated receiving nodes (e.g., node B).

As represented by block 604, the receiving node (e.g., the messagecontroller 420) may process information provided by the received RUMs toresolve any contention between the received RUMs for the use of aresource (e.g., a given carrier) based on the priorities associated withthe RUMs. For example, if several nodes send RUMs for the same resource,the node that sent the RUM associated with the highest priority may begiven priority to use the resource.

As represented by block 606, the transmitting node (e.g., thecommunication controller 426) may then determine whether to limit itstransmission in response to a received RUM. Here, the neighboringinterfering nodes (e.g., node A) may limit their transmissions sincetheir associated receiving nodes (e.g., node B) did not win thecontention for the resource. Since these interfering nodes will becleared off the resource, the transmitting node will be free to transmitto its receiving node using the resource once it is scheduled to do so(e.g., by an access point). In this case, the operational flow mayproceed to block 614.

Conversely, in the event a receiving node associated with thetransmitting node did not transmit a RUM or did not transmit a RUMhaving the highest priority, the transmitting node may determine whetherits transmission will interfere with reception at the RUM-sending nodethat sent the highest weight RUM. In some aspects, this determinationmay involve comparing a RUM rejection threshold with a value associatedwith (e.g., derived from) the received RUM. In other words, thetransmitting node may elect to obey or ignore the RUM depending onwhether this value is less than, greater than, or equal to thethreshold. For example, the RUM rejection threshold may be defined as avalue that represents the maximum allowable level of interference at theRUM-sending node (e.g., node B). In this case, the transmitting node(e.g., an interference controller 428) may estimate the amount ofinterference a transmission from transmitting node would cause at theRUM-sending node. The transmitting node may then compare thisinterference estimate with the RUM rejection threshold.

Such an interference estimate may be generated in various ways. Forexample, as mentioned above, a RUM may be transmitted at a known powerlevel. In addition, the RUM may be transmitted over a noise-limitedchannel control channel as described above where the received signalstrength of the RUM may be proportional to the signal-to-noise ratio.The transmitting node may thus determine the path loss to theRUM-sending node by, for example, measuring the power of the receivedRUM (e.g., at the receiver 416). Based on this path loss information andthe known transmit power of the transmitter 414, the transmitting nodemay estimate the level of interference its transmission will cause atthe RUM-sending node.

If the interference estimate value is less than (or less than or equalto) the RUM rejection threshold—thereby indicating that the interferencewill fall below a specified level—the transmitting node may elect toignore the RUM. In this case, the operation flow may continue normaltransmission operations.

Otherwise, the transmitting node may elect to limit its transmission asrepresented by block 608. A transmitting node may limit transmission invarious ways. For example, a node may limit transmission by abstainingfrom transmitting during a transmission opportunity (e.g., delayingtransmission by electing to transmit at a later time), reducing transmitpower, reducing data transmission rate, using different coding (e.g.,modifying a coding scheme), transmitting on another resource (e.g.,using a different frequency carrier), performing some other suitableoperation, or performing some combination of the above.

As represented by blocks 610 and 612, in the event the transmitting nodeelected to obey a received RUM, the transmitting node may wait until theresource is freed before commencing any further transmission operations(e.g., sending a request to transmit) on that resource. For example, asmentioned above the transmitting node may wait until it receives aresource release message (e.g., RRM-B) at block 610 or may wait untilthe RUM expires at block 612 (e.g., the time-to-live time period haselapsed).

As represented by block 614, the transmission controller 426 may ceaselimiting transmission once the RUM in no longer active. Thus, thetransmitting node may continue with its transmission operations, subjectto an intervening receipt of a high weight RUM from another receivingnode. For example, if an RxRUM sent by its associated receiving node ispending (e.g., previously transmitted but not yet expired), thetransmitting node may wait until that RxRUM has the highest priority(e.g., all other higher priority RxRUMs are no longer valid) and thensend a TxRUM.

Referring now to FIG. 7, several ReqRUM-related operations that may beperformed by a transmitting node will be treated. As represented byblocks 702 and 704, a transmitting node (e.g., node A) may transmit datato its associated receiving node (e.g., node B) during a given TXOP.

As represented by block 706, once the TXOP is complete, the transmittingnode may transmit a ReqRUM (e.g., ReqRUM-A) to request neighboringreceiving nodes to send RUMs. As mentioned above, this action maycommence the status update period (e.g., STU-A). Also as mentionedabove, the ReqRUM may be transmitted at a known power level and mayinclude an indication of the transmit power the transmitting node (e.g.,the transmitter 414) will use to transmit its data. Such a transmitpower indication may comprise, for example, a weight field thatindicates the transmit power class of the transmitting node.

As represented by blocks 708 and 710, the transmitting node (e.g., byoperation of the communication controller 426 and the receiver 416)monitors the control channel for RUMs (e.g., RxRUM-D) for the entirestatus update period. As represented by blocks 712 and 714, if no RUMsare received during the status update period, the transmitting node maycontinue with its standard operations. For example, if node A has datato send to node B, node A may issue a request REQ-A in an attempt tocommence this data transmission.

As represented by block 716, if one or more RUMs were received duringthe status update period, the transmitting node may determine whether itneeds to react to (e.g., obey) the RUMs. In this case, the transmittingnode may perform operations as described above in conjunction with FIG.6.

Referring now to FIG. 8, in some aspects a node may be configured tooperate in a synchronous manner or an asynchronous manner with respectto one or more neighboring nodes. For example, if an associated set ofnodes is not able to acquire timing from a neighboring non-associatednode, the set of nodes may initially establish communication that is notsynchronized to the communication of the non-associated node. However,if the set of nodes is able to acquire such timing at a later point intime, the set of nodes may transition to a mode of operation where suchcommunications are synchronized. To this end, the transmitting andreceiving nodes 402 and 404 may include respective mode controllers 430and 432 to facilitate switching between synchronous and asynchronousmodes of operation.

The operations of FIG. 8 will be described commencing at block 802 wherethe nodes commence an asynchronous mode of operation. As represented byblocks 804, 806 and 808, a set of associated nodes may define severaltime periods for asynchronous operations. For example, at block 804 thenodes may define an update period (e.g., Tu) along with the associatedtransmit mode time period. At block 806 the nodes may define a statusupdate period (e.g., STU). At block 808 the nodes may define a TXOP timeperiod. In some aspects the definition of the time periods may involveobtaining time period information (e.g., default time periods specifiedby a service provider) that are stored in a data memory. For example, asshown in FIG. 4, the nodes 402 and 404 may maintain TXOP time periodinformation 434, update time period information 436, status update timeperiod information 438, and transmit mode time period information 440.

As represented by blocks 810 and 812, the set of nodes may continue totransmit and receive data in this asynchronous mode of operation until adecision is made to switch to a synchronous mode of operation. Asmentioned above, such a decision may be made based on a determination bythe mode controllers 430 and 432 that suitable timing information may beacquired for synchronous operation.

When the mode controllers 430 and 432 elect to initiate a switch to asynchronous mode of operation (block 814), this transition may beaccomplished in a relatively efficient and non-intrusive manner bysetting one or more of the time periods described above to values thatcorrespond to the timeslot timing used in the synchronous mode. Forexample, at block 816 the update period Tu may be set equal to the size(e.g., duration) of a timeslot used for synchronous operation. Inaddition, at block 818, the TXOP period may be set equal to N×Tu, whereN is an integer.

Also at block 820, the mode controllers 430 and 432 may disableprocessing relating to the transmission of certain control messages. Insome aspects, status update period STU messages such as ReqRUM may bedisabled since, in a synchronous operating mode, all of the RxRUMs for agiven timeslot should be heard by any nodes that could interfere withthat timeslot. For example, all nodes that wish to use a given timeslotmay be configured to transmit their RUMs at known times (e.g., adesignated number of timeslots before the timeslot being reserved).

In the case where N=1 (i.e., TXOP=Tu=timeslot size), a transmitting nodewill be silent for a Tu period after every TXOP. This configuration maybe used for a synchronous mode of operation that uses transmit andreceive timeslots of equal size. Here, a node may select the timeslotson which it will transmit or receive by sending a request message at theappropriate time. When N=1, the resource release message also may bedisabled since the nodes will transmit and receive on alternatingtimeslots of a known duration.

In the case where N>1 (i.e., Tu=timeslot size, and TXOP=N×Tu), the TXOPsize may be different for different nodes, and for differenttransmission opportunities. In this case, after every Tu, a transmittingnode may pause to listen for any new RxRUMs. In addition, a resourcerelease message may be transmitted at the end of the TXOP to enablepreviously blocked nodes to use the resource. Here, a node that wants arepeated TXOP (e.g., repeated access to a resource) may be configured towait one timeslot before attempting to use the resource again.

If a transmitting node receives a RUM with a higher priority (e.g.,weight component), the node may cease its transmission to allow thehigher priority transmission to have access to the resource. In such acase, since the receiving node associated with that transmitting nodewill no longer receive data, the receiving node may send a new RxRUM(e.g., with a higher priority) and wait for a new TxRUM in response.

As represented by blocks 822 and 824 of FIG. 8, the set of nodes maycontinue to transmit and receive data in this synchronous mode ofoperation until a decision is made to switch to an asynchronous mode ofoperation. Such a decision may be made based, for example, on adetermination by the mode controllers 430 and 432 that timinginformation necessary for synchronous operation has been lost.

The teachings herein may be incorporated into a device employing variouscomponents for communicating with at least one other wireless device.FIG. 9 depicts several sample components that may be employed tofacilitate communication between devices. Here, a first device 902(e.g., an access terminal) and a second device 904 (e.g., an accesspoint) are configured to communicate via a wireless communication link906 over a suitable medium.

Initially, components involved in sending information from the device902 to the device 904 (e.g., a reverse link) will be treated. A transmit(“TX”) data processor 908 receives traffic data (e.g., data packets)from a data buffer 910 or some other suitable component. The transmitdata processor 908 processes (e.g., encodes, interleaves, and symbolmaps) each data packet based on a selected coding and modulation scheme,and provides data symbols. In general, a data symbol is a modulationsymbol for data, and a pilot symbol is a modulation symbol for a pilot(which is known a priori). A modulator 912 receives the data symbols,pilot symbols, and possibly signaling for the reverse link, and performsmodulation (e.g., OFDM or some other suitable modulation) and/or otherprocessing as specified by the system, and provides a stream of outputchips. A transmitter (“TMTR”) 914 processes (e.g., converts to analog,filters, amplifies, and frequency upconverts) the output chip stream andgenerates a modulated signal, which is then transmitted from an antenna916.

The modulated signals transmitted by the device 902 (along with signalsfrom other devices in communication with the device 904) are received byan antenna 918 of the device 904. A receiver (“RCVR”) 920 processes(e.g., conditions and digitizes) the received signal from the antenna918 and provides received samples. A demodulator (“DEMOD”) 922 processes(e.g., demodulates and detects) the received samples and providesdetected data symbols, which may be a noisy estimate of the data symbolstransmitted to the device 904 by the other device(s). A receive (“RX”)data processor 924 processes (e.g., symbol demaps, deinterleaves, anddecodes) the detected data symbols and provides decoded data associatedwith each transmitting device (e.g., device 902).

Components involved in sending information from the device 904 to thedevice 902 (e.g., a forward link) will be now be treated. At the device904, traffic data is processed by a transmit (“TX”) data processor 926to generate data symbols. A modulator 928 receives the data symbols,pilot symbols, and signaling for the forward link, performs modulation(e.g., OFDM or some other suitable modulation) and/or other pertinentprocessing, and provides an output chip stream, which is furtherconditioned by a transmitter (“TMTR”) 930 and transmitted from theantenna 918. In some implementations signaling for the forward link mayinclude power control commands and other information (e.g., relating toa communication channel) generated by a controller 932 for all devices(e.g. terminals) transmitting on the reverse link to the device 904.

At the device 902, the modulated signal transmitted by the device 904 isreceived by the antenna 916, conditioned and digitized by a receiver(“RCVR”) 934, and processed by a demodulator (“DEMOD”) 936 to obtaindetected data symbols. A receive (“RX”) data processor 938 processes thedetected data symbols and provides decoded data for the device 902 andthe forward link signaling. A controller 940 receives power controlcommands and other information to control data transmission and tocontrol transmit power on the reverse link to the device 904.

The controllers 940 and 932 direct various operations of the device 902and the device 904, respectively. For example, a controller maydetermine an appropriate filter, reporting information about the filter,and decode information using a filter. Data memories 942 and 944 maystore program codes and data used by the controllers 940 and 932,respectively.

FIG. 9 also illustrates that the communication components may includeone or more components that perform messaging operations as taughtherein. For example, a message control component 946 may cooperate withthe controller 940 and/or other components of the device 902 to send andreceive signals to another device (e.g., device 904) as taught herein.Similarly, a message control component 948 may cooperate with thecontroller 932 and/or other components of the device 904 to send andreceive signals to another device (e.g., device 902). It should beappreciated that for each device 902 and 904 the functionality of two ormore of the described components may be provided by a single component.For example, a single processing component may provide the functionalityof the message control component 946 and the controller 940 and a singleprocessing component may provide the functionality of the messagecontrol component 948 and the controller 932.

The teachings herein may be incorporated into (e.g., implemented withinor performed by) a variety of apparatuses (e.g., devices). For example,each node may be configured, or referred to in the art, as an accesspoint (“AP”), NodeB, Radio Network Controller (“RNC”), eNodeB, BaseStation Controller (“BSC”), Base Transceiver Station (“BTS”), BaseStation (“BS”), Transceiver Function (“TF”), Radio Router, RadioTransceiver, Basic Service Set (“BSS”), Extended Service Set (“ESS”),Radio Base Station (“RBS”), or some other terminology. Certain nodesalso may be referred to as access terminals. An access terminal also maybe known as a subscriber station, a subscriber unit, a mobile station, aremote station, a remote terminal, a user terminal, a user agent, a userdevice, or user equipment. In some implementations an access terminalmay comprise a cellular telephone, a cordless telephone, a SessionInitiation Protocol (“SIP”) phone, a wireless local loop (“WLL”)station, a personal digital assistant (“PDA”), a handheld device havingwireless connection capability, or some other suitable processing deviceconnected to a wireless modem. Accordingly, one or more aspects taughtherein may be incorporated into a phone (e.g., a cellular phone or smartphone), a computer (e.g., a laptop), a portable communication device, aportable computing device (e.g., a personal data assistant), anentertainment device (e.g., a music or video device, or a satelliteradio), a global positioning system device, or any other suitable devicethat is configured to communicate via a wireless medium.

As mentioned above, in some aspects a wireless node may comprise anaccess device (e.g., a cellular or Wi-Fi access point) for acommunication system. Such an access device may provide, for example,connectivity for or to a network (e.g., a wide area network such as theInternet or a cellular network) via a wired or wireless communicationlink. Accordingly, the access device may enable another device (e.g., aWi-Fi station) to access the network or some other functionality.

A wireless node may thus include various components that performfunctions based on data transmitted by or received at the wireless node.For example, an access point and an access terminal may include anantenna for transmitting and receiving signals (e.g., messages relatingto control and/or data). An access point also may include a trafficmanager configured to manage data traffic flows that its receiverreceives from a plurality of wireless nodes or that its transmittertransmits to a plurality of wireless nodes. In addition, an accessterminal may include a user interface configured to output an indicationbased on received data. For example, as discussed herein in some aspectssuch data may be received after issuance of a RUM and before issuance ofa resource release message.

A wireless device may communicate via one or more wireless communicationlinks that are based on or otherwise support any suitable wirelesscommunication technology. For example, in some aspects a wireless devicemay associate with a network. In some aspects the network may comprise alocal area network or a wide area network. A wireless device may supportor otherwise use one or more of a variety of wireless communicationtechnologies, protocols, or standards such as, for example, CDMA, TDMA,OFDM, OFDMA, WiMAX, and Wi-Fi. Similarly, a wireless device may supportor otherwise use one or more of a variety of corresponding modulation ormultiplexing schemes. A wireless device may thus include appropriatecomponents (e.g., air interfaces) to establish and communicate via oneor more wireless communication links using the above or other wirelesscommunication technologies. For example, a device may comprise awireless transceiver with associated transmitter and receiver components(e.g., transmitters 408 and 414 and receivers 410 and 416) that mayinclude various components (e.g., signal generators and signalprocessors) that facilitate communication over a wireless medium.

The components described herein may be implemented in a variety of ways.FIG. 10 depicts apparatuses 1002 and 1004 that are representative ofreceiving and transmitting nodes, respectively and FIG. 11 depictsapparatuses 1102 and 1104 that are representative of transmitting andreceiving nodes, respectively. The apparatuses 1002, 1004, 1102, and1104 are represented as a series of interrelated functional blocks thatmay represent functions implemented by, for example, one or moreintegrated circuits (e.g., an ASIC) or may be implemented in some othermanner as taught herein. As discussed herein, an integrated circuit mayinclude a processor, software, other components, or some combinationthereof

The apparatus 1002, 1004, 1102, and 1104 may include one or more modulesthat may perform one or more of the functions described above withregard to various figures. For example, an ASIC for providing 1006 maycorrespond to, for example, a message controller 418 as discussedherein. An ASIC for transmitting 1008 or 1116 may correspond to, forexample, a transmitter 408 as discussed herein. An ASIC for receiving1010 or 1114 may correspond to, for example, a receiver 410 as discussedherein. An ASIC for switching to transmit mode 1012 or 1120 maycorrespond to, for example, a communication controller 424 as discussedherein. An ASIC for switching from asynchronous mode to synchronous mode1014 or 1124 may correspond to, for example, a mode controller 430 asdiscussed herein. An ASIC for determining interference 1016 maycorrespond to, for example, an interference controller 422 as discussedherein. An ASIC for receiving 1018 may correspond to, for example, areceiver 416 as discussed herein. An ASIC for limiting transmission 1020may correspond to, for example, a communication controller 426 asdiscussed herein. An ASIC for transmitting 1106 may correspond to, forexample, a transmitter 414 as discussed herein. An ASIC for monitoring1108 may correspond to, for example, a receiver 416 as discussed herein.An ASIC for determining whether to limit transmission 1110 maycorrespond to, for example, a communication controller 426 as discussedherein. An ASIC for switching from asynchronous mode to synchronous mode1112 may correspond to, for example, a mode controller 432 as discussedherein. An ASIC for determining a designated time 1118 may correspondto, for example, a message controller 418 as discussed herein. An ASICfor determining whether to transmit 1122 may correspond to, for example,a communication controller 424 as discussed herein.

As noted above, in some aspects these components may be implemented viaappropriate processor components. These processor components may in someaspects be implemented, at least in part, using structure as taughtherein. In some aspects a processor may be adapted to implement aportion or all of the functionality of one or more of these components.In some aspects one or more of the components represented by dashedboxes are optional.

As noted above, the apparatus 1002, 1004, 1102, and 1104 may compriseone or more integrated circuits. For example, in some aspects a singleintegrated circuit may implement the functionality of one or more of theillustrated components, while in other aspects more than one integratedcircuit may implement the functionality of one or more of theillustrated components.

In addition, the components and functions represented by FIGS. 10 and 11as well as other components and functions described herein, may beimplemented using any suitable means. Such means also may beimplemented, at least in part, using corresponding structure as taughtherein. For example, the components described above in conjunction withthe “ASIC for” components of FIGS. 10 and 11 also may correspond tosimilarly designated “means for” functionality. Thus, in some aspectsone or more of such means may be implemented using one or more ofprocessor components, integrated circuits, or other suitable structureas taught herein.

Also, it should be understood that any reference to an element hereinusing a designation such as “first,” “second,” and so forth does notgenerally limit the quantity or order of those elements. Rather, thesedesignations may be used herein as a convenient method of distinguishingbetween two or more elements or instances of an element. Thus, areference to first and second elements does not mean that only twoelements may be employed there or that the first element must precedethe second element in some manner. Also, unless stated otherwise a setof elements may comprise one or more elements. In addition, terminologyof the form “at least one of: A, B, or C” used in the description or theclaims means “A or B or C or any combination thereof”

Those of skill in the art would understand that information and signalsmay be represented using any of a variety of different technologies andtechniques. For example, data, instructions, commands, information,signals, bits, symbols, and chips that may be referenced throughout theabove description may be represented by voltages, currents,electromagnetic waves, magnetic fields or particles, optical fields orparticles, or any combination thereof.

Those of skill would further appreciate that any of the variousillustrative logical blocks, modules, processors, means, circuits, andalgorithm steps described in connection with the aspects disclosedherein may be implemented as electronic hardware (e.g., a digitalimplementation, an analog implementation, or a combination of the two,which may be designed using source coding or some other technique),various forms of program or design code incorporating instructions(which may be referred to herein, for convenience, as “software” or a“software module”), or combinations of both. To clearly illustrate thisinterchangeability of hardware and software, various illustrativecomponents, blocks, modules, circuits, and steps have been describedabove generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular application and design constraints imposed on the overallsystem. Skilled artisans may implement the described functionality invarying ways for each particular application, but such implementationdecisions should not be interpreted as causing a departure from thescope of the present disclosure.

The various illustrative logical blocks, modules, and circuits describedin connection with the aspects disclosed herein may be implementedwithin or performed by an integrated circuit (“IC”), an access terminal,or an access point. The IC may comprise a general purpose processor, adigital signal processor (DSP), an application specific integratedcircuit (ASIC), a field programmable gate array (FPGA) or otherprogrammable logic device, discrete gate or transistor logic, discretehardware components, electrical components, optical components,mechanical components, or any combination thereof designed to performthe functions described herein, and may execute codes or instructionsthat reside within the IC, outside of the IC, or both. A general purposeprocessor may be a microprocessor, but in the alternative, the processormay be any conventional processor, controller, microcontroller, or statemachine. A processor may also be implemented as a combination ofcomputing devices, e.g., a combination of a DSP and a microprocessor, aplurality of microprocessors, one or more microprocessors in conjunctionwith a DSP core, or any other such configuration.

It is understood that any specific order or hierarchy of steps in anydisclosed process is an example of a sample approach. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the processes may be rearranged while remaining within thescope of the present disclosure. The accompanying method claims presentelements of the various steps in a sample order, and are not meant to belimited to the specific order or hierarchy presented.

The steps of a method or algorithm described in connection with theaspects disclosed herein may be embodied directly in hardware, in asoftware module executed by a processor, or in a combination of the two.A software module (e.g., including executable instructions and relateddata) and other data may reside in a data memory such as RAM memory,flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a harddisk, a removable disk, a CD-ROM, or any other form of computer-readablestorage medium known in the art. A sample storage medium may be coupledto a machine such as, for example, a computer/processor (which may bereferred to herein, for convenience, as a “processor”) such theprocessor can read information (e.g., code) from and write informationto the storage medium. A sample storage medium may be integral to theprocessor. The processor and the storage medium may reside in an ASIC.The ASIC may reside in user equipment. In the alternative, the processorand the storage medium may reside as discrete components in userequipment. Moreover, in some aspects any suitable computer-programproduct may comprise a computer-readable medium comprising codes (e.g.,executable by at least one computer) relating to one or more of theaspects of the disclosure. In some aspects a computer program productmay comprise packaging materials.

The previous description of the disclosed aspects is provided to enableany person skilled in the art to make or use the present disclosure.Various modifications to these aspects will be readily apparent to thoseskilled in the art, and the generic principles defined herein may beapplied to other aspects without departing from the scope of thedisclosure. Thus, the present disclosure is not intended to be limitedto the aspects shown herein but is to be accorded the widest scopeconsistent with the principles and novel features disclosed herein.

1. A method of wireless communication, comprising: receiving a firstinterference management message that comprises a request for reductionin interference; limiting transmission in response to the request; andreceiving a second interference management message that indicates thatthe request for reduction in interference is terminated.
 2. The methodof claim 1, wherein the request for reduction in interference relates toan unspecified amount of time.
 3. The method of claim 1, wherein therequest for reduction in interference expires after a defined period oftime, the method further comprising ceasing the limitation oftransmission in response to the expiration of the request.
 4. The methodof claim 1, wherein the limitation of transmission comprises at leastone of: abstaining from transmitting, reducing transmit power, reducingdata transmission rate, modifying a coding scheme, or transmitting onanother resource.
 5. The method of claim 1, further comprising:determining a received power level associated with the firstinterference management message, wherein the first interferencemanagement message was transmitted at a constant power spectral density;and determining whether to limit the transmission based on the constantpower spectral density and the received power level.
 6. The method ofclaim 1, wherein the first interference management message furthercomprises a priority indication indicative of a level of disadvantageassociated with reception of data at a node that transmitted the firstinterference management message, the method further comprising:determining whether to limit the transmission based on the priorityindication.
 7. An apparatus for wireless communication, comprising: areceiver configured to receive: a first interference management messagethat comprises a request for reduction in interference, and a secondinterference management message that indicates that the request forreduction in interference is terminated; and a communication controllerconfigured to limit transmission in response to the request.
 8. Theapparatus of claim 7, wherein the request for reduction in interferencerelates to an unspecified amount of time.
 9. The apparatus of claim 7,wherein: the request for reduction in interference expires after adefined period of time; and the communication controller is furtherconfigured to cease the limitation of transmission in response to theexpiration of the request.
 10. The apparatus of claim 7, wherein thelimitation of transmission comprises at least one of: abstaining fromtransmitting, reducing transmit power, reducing data transmission rate,modifying a coding scheme, or transmitting on another resource.
 11. Theapparatus of claim 7, wherein: the first interference management messagewas transmitted at a constant power spectral density; the receiver isfurther configured to determine a received power level associated withthe first interference management message; and the communicationcontroller is further configured to determine whether to limit thetransmission based on the constant power spectral density and thereceived power level.
 12. The apparatus of claim 7, wherein: the firstinterference management message further comprises a priority indicationindicative of a level of disadvantage associated with reception of dataat a node that transmitted the first interference management message;and the communication controller is further configured to determinewhether to limit the transmission based on the priority indication. 13.An apparatus for wireless communication, comprising: means forreceiving: a first interference management message that comprises arequest for reduction in interference, and a second interferencemanagement message that indicates that the request for reduction ininterference is terminated; and means for limiting transmission inresponse to the request.
 14. The apparatus of claim 13, wherein therequest for reduction in interference relates to an unspecified amountof time.
 15. The apparatus of claim 13, wherein: the request forreduction in interference expires after a defined period of time; andthe means for limiting is configured to cease the limitation oftransmission in response to the expiration of the request.
 16. Theapparatus of claim 13, wherein the limitation of transmission comprisesat least one of: abstaining from transmitting, reducing transmit power,reducing data transmission rate, modifying a coding scheme, ortransmitting on another resource.
 17. The apparatus of claim 13,wherein: the first interference management message was transmitted at aconstant power spectral density; the means for receiving is configuredto determine a received power level associated with the firstinterference management message; and the means for limiting isconfigured to determine whether to limit the transmission based on theconstant power spectral density and the received power level.
 18. Theapparatus of claim 13, wherein: the first interference managementmessage further comprises a priority indication indicative of a level ofdisadvantage associated with reception of data at a node thattransmitted the first interference management message; and the means forlimiting is configured to determine whether to limit the transmissionbased on the priority indication.
 19. A computer-program product forwireless communication, comprising: computer-readable medium comprisingcodes executable to: receive a first interference management messagethat comprises a request for reduction in interference; limittransmission in response to the request; and receive a secondinterference management message that indicates that the request forreduction in interference is terminated.
 20. An access point,comprising: an antenna; a receiver configured to receive, via theantenna: a first interference management message that comprises arequest for reduction in interference, and a second interferencemanagement message that indicates that the request for reduction ininterference is terminated; and a communication controller configured tolimit transmission in response to the request.
 21. An access terminal,comprising: a receiver configured to receive: a first interferencemanagement message that comprises a request for reduction ininterference, and a second interference management message thatindicates that the request for reduction in interference is terminated;a communication controller configured to limit transmission in responseto the request; and a user interface configured to output an indicationbased on data received via the receiver.